Exact performance of concatenated quantum codes

نویسندگان

  • Benjamin Rahn
  • Andrew C. Doherty
  • Hideo Mabuchi
چکیده

When a logical qubit is protected using a quantum error-correcting code, the net effect of coding, decoherence ~a physical channel acting on qubits in the codeword! and recovery can be represented exactly by an effective channel acting directly on the logical qubit. In this paper we describe a procedure for deriving the map between physical and effective channels that results from a given coding and recovery procedure. We show that the map for a concatenation of codes is given by the composition of the maps for the constituent codes. This perspective leads us to an efficient means for calculating the exact performance of quantum codes with arbitrary levels of concatenation. We present explicit results for single-bit Pauli channels. For certain codes under the symmetric depolarizing channel, we use the coding maps to compute exact threshold error probabilities for achievability of perfect fidelity in the infinite concatenation limit.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fault-Tolerant Quantum Computation with Local Gates

I discuss how to perform fault-tolerant quantum computation with concatenated codes using local gates in small numbers of dimensions. I show that a threshold result still exists in three, two, or one dimensions when next-to-nearest-neighbor gates are available, and present explicit constructions. In two or three dimensions, I also show how nearestneighbor gates can give a threshold result. In a...

متن کامل

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

Concatenated Capacity-Achieving Polar Codes for Optical Quantum Channels

We construct concatenated capacity-achieving quantum codes for noisy optical quantum channels. We demonstrate that the error-probability of capacityachieving quantum polar encoding can be reduced by the proposed low-complexity concatenation scheme. OCIS codes: (270.5585); (270.5565).

متن کامل

Performance of iterative multiuser detection with a partial PIC detector and serially concatenated codes

An iterative multiuser detection scheme is proposed for DS-CDMA system. An iterative multiuser detection has a partial parallel interference cancellation (PIC) detector and serially concatenated codes. Taking the expectation value of a coded bit the partial PIC detector produces a metric, which becomes an input to the decoders. It is shown that the proposed iterative multiuser detector has near...

متن کامل

Several Classes of Concatenated Quantum Codes: Constructions and Bounds

In this paper we present several classes of asymptotically good concatenated quantum codes and derive lower bounds on the minimum distance and rate of the codes. We compare these bounds with the best-known bound of Ashikhmin–Litsyn–Tsfasman and Matsumoto. We also give a polynomial-time decoding algorithm for the codes that can decode up to one fourth of the lower bound on the minimum distance o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002